Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems

Article history: Received 9 December 2015 Received in revised form 18 April 2016 Accepted 20 April 2016 Available online 29 April 2016

متن کامل

A Pointwise Ergodic Theorem for Imprecise Markov Chains

We prove a game-theoretic version of the strong law of large numbers for submartingale differences, and use this to derive a pointwise ergodic theorem for discrete-time Markov chains with finite state sets, when the transition probabilities are imprecise, in the sense that they are only known to belong to some convex closed set of probability measures.

متن کامل

Imprecise Markov chains with absorption

Consider a discrete time Markov chain X = {X(n), n = 0, 1, . . .} with finite state space S = {−1} ∪ C, where C = {0, . . . , s} is a single communicating class with all states aperiodic. Assuming −1 can be reached from C, absorption is certain, making the limiting distribution (1, 0, . . . , 0). Instead of considering the limiting distribution, then, we condition at non-absorption at each time...

متن کامل

Learning Imprecise Hidden Markov Models

Consider a stationary precise hidden Markov model (HMM) with n hidden states Xk, taking values xk in a set {1, . . . ,m} and n observations Ok, taking values ok. Both the marginal model pX1(x1), the emission models pOk|Xk(ok|xk) and the transition models pXk|Xk−1(xk|xk−1) are unknown. We can then use the Baum–Welch algorithm [see, e.g., 4] to get a maximum-likelihood estimate of these models. T...

متن کامل

Action Recognition by Imprecise Hidden Markov Models

Hidden Markov models (HMMs) are powerful tools to capture the dynamics of a human action by providing a sufficient level of abstraction to recognise what two video sequences, depicting the same kind of action, have in common. If the sequence is short and hence only few data are available, the EM algorithm, which is generally employed to learn HMMs, might return unreliable estimates. As a possib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2016

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2016.04.009